Construction of Time Relaxed Minimal Broadcast Networks
نویسندگان
چکیده
In broadcasting, or one-to-all communication, a message originally held in one node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message originated at any node to all other nodes of the network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal broadcast networks (t-mbn), in which broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new network by connecting a subset of nodes from several copies of a t1-mbn using the structure of another t2-mbn. The objective is to construct a network as sparse as possible satisfying the desired broadcasting time constraint. Computational results illustrate the eeectiveness of the proposed method.
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملBinary linear programming models for robust broadcasting in communication networks
Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a kfault tolerant c-broadcast network, the broadcasting process c...
متن کاملMinimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the same broadcast tree. Our approach differs from the most commonly used one where the determination of the broadcast tree depends on the source node, thus resulting in different tree construction processes for different ...
متن کاملAlgebraic Constructions of E cient Broadcast Networks
Cayley graph techniques are introduced for the problem of constructing networks having the maximum possible number of nodes, among networks that satisfy prescribed bounds on the parameters maximum node degree and broadcast diameter. The broadcast diameter of a network is the maximum time required for a message originating at a node of the network to be relayed to all other nodes, under the rest...
متن کاملMinimal Time Broadcasting in Cognitive Radio Networks
This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 9 شماره
صفحات -
تاریخ انتشار 1999